Multi-Skills Resource Constrained and Personality Traits Based Project Scheduling

نویسندگان

چکیده

One of the primary jobs a software project manager is to assign available resources development tasks in such way that results high-quality product at low cost. Software Project Scheduling (SPS) allocates most appropriate human resource activities right time reduce failure risks and minimise makespan. In literature, SPS problem referred as Multiple Resource-Constrained Problem (MRCPSP). The MRCPSP assigns with multiple skills proficiency levels various activities. Human abilities can be distinguished into technical/hard non-technical/soft skills. former describes related technology, tools, etc. While latter deals personality, being introvert, extrovert, sensing, Recent studies have shown some may require specific soft Moreover, efficiency productivity assigned significantly if skill requirements are ignored during task allocation. Ultimately, process might end up lower-quality products higher costs; worst case, even fail. Several MRCPSP-based approaches been designed costs projects. These mechanisms consider hard different levels. However, they overlook required leading inefficiency allocated resources. This will increase makespan cause or failures. Therefore, fill this gap, we propose Multi-Skill Resource Constrained Personality Traits based (MSRCPPS) considering well technical SPS. main objective minimize Finally, effectiveness our proposed approach evaluated against existing state-of-the-art using extensive simulations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...

متن کامل

the combinatorial multi-mode resource constrained multi-project scheduling problem

this paper presents the formulation and solution of the combinatorial multi-mode resource constrained multi-project scheduling problem. the focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. the motivation for developing such an approach is due in part to practica...

متن کامل

A multi-objective resource-constrained project scheduling problem with time lags and fuzzy activity durations

The resource-constrained project scheduling problem is to find a schedule that minimizes the project duration subject to precedence relations and resource constraints. To further account for economic aspects of the project, one may add an objective of cash nature to the problem. In addition, dynamic nature and variations in real world are known to introduce uncertainties into data. Therefore, t...

متن کامل

Modeling and solving multi-skilled resource-constrained project scheduling problem with calendars in fuzzy condition

In this study, we aim to present a new model for the resource-constrained project scheduling problem (RCPSP) considering a working calendar for project members and determined the skill factor of any member using the efficiency concept. For this purpose, the recyclable resources are staff resources where any person with multiple skills can meet the required skills of activities in a given time. ...

متن کامل

A multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project

This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2022

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2022.3229867